Parsing...
Parsing: [0.010s CPU, 0.002s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.000s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.001s wall-clock]
Preparing model... [0.000s CPU, 0.001s wall-clock]
Generated 53 rules.
Computing model... [0.000s CPU, 0.003s wall-clock]
188 relevant atoms
155 auxiliary atoms
343 final queue length
635 total queue pushes
Completing instantiation... [0.010s CPU, 0.004s wall-clock]
Instantiating: [0.010s CPU, 0.009s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.000s CPU, 0.004s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
17 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.005s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.000s wall-clock]
Translating task: [0.010s CPU, 0.005s wall-clock]
160 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
10 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
6 of 11 mutex groups necessary.
100 of 100 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.001s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 64
Translator goal facts: 2
Translator mutex groups: 6
Translator total mutex groups size: 36
Translator operators: 100
Translator axioms: 0
Translator task size: 1039
Translator peak memory: 20208 KB
Writing output... [0.000s CPU, 0.001s wall-clock]
Done! [0.030s CPU, 0.026s wall-clock]
reading input... [t=2.8822e-05s]
done reading input! [t=0.00023139s]
variables: 22
goals: 2
actions: 100
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.000240353s]
done reconstructing probabilistic actions! [t=0.000364235s]
probabilistic actions: 75 (with 100 outcomes)
constructing successor generator... [t=0.00038042s]
done constructing successor generator! [t=0.000404477s]
Bytes per state: 4
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.000413546s]
hmax initialization done! [t=0.000453358s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 0.9000000000000000222
Expansions: 54
Registered states: 147
Generated states: 177
Cached transitions: 129
Expansion cache hits: 249
Transition cache hits: 883
Approximate transition cache memory usage: 6KB
Solver time: 0.0004390489999999999497s
Total time: 0.0009013220000000000823s